|
In computer science, A-normal form (abbreviated ANF) is an intermediate representation of programs in functional compilers introduced by Sabry and Felleisen in 1992 as a simpler alternative to continuation-passing style (CPS). Some of the advantages of using CPS as an intermediate representation are that optimizations are easier to perform on programs in CPS than in the source language, and that it is also easier for compilers to generate machine code for programs in CPS. Flanagan et al. showed how compilers could use ANF to achieve those same benefits with one source-level transformation; in contrast, for realistic compilers the CPS transformation typically involves additional phases, for example, to simplify CPS terms. In ANF, all arguments to a function must be trivial. That is, evaluation of each argument must halt immediately. This article deals with the basic definition expressed in terms of the λ-calculus with weak reduction and let-expressions, where the restriction is enforced by # allowing only constants, λ-terms, and variables, to serve as arguments of function applications, and # requiring that the result of a non-trivial expression be captured by a let-bound variable or returned from a function. ==Grammar== The following BNF grammar describes the pure λ-calculus modified to support the constraints of ANF: EXP ::= VAL VAL | let VAR = EXP in EXP VAL ::= λ VAR . EXP | VAR Variants of ANF used in compilers or in research often allow constants, records, tuples, multiargument functions, primitive operations and conditional expressions as well. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「A-normal form」の詳細全文を読む スポンサード リンク
|